Context-sensitive grammar

Results: 36



#Item
11Linguistics / Context-free grammar / Formal grammar / Linear grammar / Pushdown automaton / Ambiguous grammar / Controlled grammar / Context-sensitive grammar / Formal languages / Grammar / Theoretical computer science

Context-Free Languages∗ Jean Berstel Luc Boasson June 8, 2008

Add to Reading List

Source URL: www-igm.univ-mlv.fr

Language: English - Date: 2008-06-08 00:54:52
12Mathematics / Context-free grammar / Formal grammar / Terminal and nonterminal symbols / Ambiguous grammar / Regular language / Context-sensitive grammar / Controlled grammar / Formal languages / Combinatorics / Grammar

Algorithms Lecture 5: Context-Free Languages and Grammars [Fa’14] Caveat lector: This is the first edition of this lecture note. Please send bug reports and suggestions to .

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:10
13Computing / Mathematical logic / String / Comparison of programming languages / Context-free grammar / Well-formed formula / Trimming / Rope / Algorithm / Formal languages / Mathematics / Logic

Path- and Index-sensitive String Analysis Based on Monadic Second-order Logic

Add to Reading List

Source URL: researcher.ibm.com

Language: English - Date: 2013-10-05 22:24:24
14Semantics / Grammar / Predicate / Logic / Mathematical logic / Mathematics

The Semantic Dimensions of Disposition Ascriptions Abstract Recent work on the semantics of disposition ascriptions claims that dispositional predicates are context sensitive. However, the cases that are put forward to p

Add to Reading List

Source URL: www.philosophy.ox.ac.uk

Language: English - Date: 2008-10-22 10:05:09
15Mathematics / Applied mathematics / Categorial grammar / Lambda calculus / Context-sensitive grammar / Orbifold / Formal languages / Theoretical computer science / Models of computation

Advances in Abstract Categorial Grammars: Language Theory and Linguistic Modeling Makoto Kanazawa National Institue of Informatics Tokyo, Japan http://research.nii.ac.jp/˜kanazawa/

Add to Reading List

Source URL: www.loria.fr

Language: English - Date: 2009-07-29 20:41:55
16Academia / Context-free grammar / XML / Parsing / Chomsky hierarchy / Formal grammar / Context-sensitive grammar / Attribute grammar / Regular grammar / Formal languages / Linguistics / Computing

Chomsky Hierarchy for XML Developers

Add to Reading List

Source URL: www.xfront.com

Language: English - Date: 2013-12-15 17:27:35
17Grammar / Context-free grammar / Formal grammar / Terminal and nonterminal symbols / Regular grammar / Production / Context-sensitive grammar / Chomsky normal form / Formal languages / Combinatorics / Mathematics

Abstraction Super-structuring Normal Forms: Towards a Theory of Structural Induction? Adrian Silvescu and Vasant Honavar Department of Computer Science, Iowa State University, Ames, IA, USA Abstract. Induction is the pr

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2011-09-11 02:46:45
18Grammar / Context-free grammar / Formal grammar / Left recursion / Top-down parsing / Parsing / Terminal and nonterminal symbols / Context-sensitive grammar / Parse tree / Formal languages / Linguistics / Software engineering

Microsoft Word - 06-Formal-Grammars.doc

Add to Reading List

Source URL: dragonbook.stanford.edu

Language: English - Date: 2008-09-08 17:00:37
19Mathematics / Applied mathematics / Computability theory / Complexity classes / Recursively enumerable language / Unrestricted grammar / Computability / Linear bounded automaton / Context-sensitive language / Formal languages / Theoretical computer science / Theory of computation

Section 14.2 A Hierarchy of Languages Context-Sensitive Languages A context-sensitive grammar has productions of the form xAz → xyz, where A is a nonterminal and x, y, z are strings of grammar symbols with y ≠ Λ. Th

Add to Reading List

Source URL: web.cecs.pdx.edu

Language: English - Date: 2010-12-18 13:22:30
20Greek romanization / Mathematics / Applied mathematics / Beta code / Spectral theory of ordinary differential equations / Symbol / Combinatory logic / Formal grammar

Unsafe Order-2 Tree Languages are Context-Sensitive Naoki Kobayashi1 , Kazuhiro Inaba2 , and Takeshi Tsukada3 1 3

Add to Reading List

Source URL: www.kmonos.net

Language: English - Date: 2014-01-20 07:43:07
UPDATE